Metric dimension of dual polar graphs

Abstract A resolving set for a graph $$\Gamma $$ ? is collection of vertices S , chosen so that each vertex v the list distances from to members uniquely specifies . The metric dimension $$\mu (\Gamma )$$ ? ( ) smallest size We consider dual polar graphs and show it at most rank over $$\mathbb {R}$$ R incidence matrix corresponding space. then compute this give an explicit upper bound on graphs, as well halved graphs.